NCR and Intel Rewrite the Rules for POS Systems
ثبت نشده
چکیده
For any retailer, managing information technology (IT) costs is fundamental. Successful retailing is increasingly dependent on technology-driven innovation, but that does not change the fact that resources are limited. Funding those innovations requires getting the most out of the infrastructure, including point-ofsale (POS) systems. At the same time, more and more is being expected of POS systems as in-store retail strategies continually become more sophisticated. Leading retailers need both highly capable, expandable POS systems and lower overall POS costs.
منابع مشابه
A Note on Sequential Rule-Based POS Tagging
Brill’s part-of-speech tagger is defined through a cascade of leftmost rewrite rules. We revisit the compilation of such rules into a single sequential transducer given by Roche and Schabes (Comput. Ling. 1995) and provide a direct construction of the minimal sequential transducer for each individual rule.
متن کاملAuthorship and date classification using syntactic tree features
Authorship classification of documents using syntactic features has shown high levels of success; however the complexity in mining syntactic features has generally limited them to a basic feature set (POS tags, rewrite rules). S. Kim et al. [1] have proposed a novel algorithm to generated a set of syntactic features based on frequent subtree patterns of a set of syntactic trees. In this paper, ...
متن کاملTermination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules
We show that termination is decidable for rewrite systems that contain shallow and right-linear rules, collapsing rules, and rightground rules. This class of rewrite systems is expressive enough to include interesting rules. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving and hence the reachability and joinability problems are decidable. Decidabil...
متن کاملSeparation Logic Verification of C Programs with an SMT Solver
This paper presents a methodology for automated modular verification of C programs against specifications written in separation logic. The distinguishing features of the approach are representation of the C memory model in separation logic by means of rewrite rules suitable for automation and the careful integration of an SMT solver behind the separation logic prover to guide the proof search.
متن کاملCentrum Voor Wiskunde En Informatica within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). Keywords and Phrases: minimal term rewriting systems, abstract machines, program transformations Note: Part of this w...
متن کامل